Polynomial Algorithm for Fixed Points of Nontrivial Morphisms
نویسنده
چکیده
A word w is a fixed point of a nontrival morphism h if w = h(w) and h is not the identity on the alphabet of w. The paper presents the first polynomial algorithm deciding whether a given word is such a fixed point. The algorithm also constructs the corresponding morphism, which has the smallest possible number of non-erased letters.
منابع مشابه
Complexity of testing morphic primitivity
The word u = abaaba satisfies f(u) = u where f maps b to aba and cancels a. Such words, which are fixed points of a nontrivial morphism, are called morphically imprimitive. On the other hand, the word u′ = abba can be easily verified to be morphically primitive, which means that the only morphism satisfying f(u′) = u′ defined on {a, b}∗ is the identity. Fixed points of word morphisms and morphi...
متن کاملOn Almost Periodicity Criteria for Morphic Sequences in Some Particular Cases
In some particular cases we give criteria for morphic sequences to be almost periodic (=uniformly recurrent). Namely, we deal with fixed points of non-erasing morphisms and with automatic sequences. In both cases a polynomial-time algorithm solving the problem is found. A result more or less supporting the conjecture of decidability of the general problem is given.
متن کاملMorphisms and Inverse Problems for Darboux Integrating Factors
Polynomial vector fields which admit a prescribed Darboux integrating factor are quite well-understood when the geometry of the underlying curve is nondegenerate. In the general setting morphisms of the affine plane may remove degeneracies of the curve, and thus allow more structural insight. In the present paper we establish some properties of integrating factors subjected to morphisms, and we...
متن کاملOn the Asymptotic Abelian Complexity of Morphic Words
The subword complexity of an infinite word counts the number of subwords of a given length, while the abelian complexity counts this number up to letter permutation. Although a lot of research has been done on the subword complexity of morphic words, i.e., words obtained as fixed points of iterated morphisms, little is known on their abelian complexity. In this paper, we undertake the classific...
متن کاملStrong convergence of variational inequality problem Over the set of common fixed points of a family of demi-contractive mappings
In this paper, by using the viscosity iterative method and the hybrid steepest-descent method, we present a new algorithm for solving the variational inequality problem. The sequence generated by this algorithm is strong convergence to a common element of the set of common zero points of a finite family of inverse strongly monotone operators and the set of common fixed points of a finite family...
متن کامل